A Non-repudiable Biased Bitstring Commitment Scheme on a Post Quantum Cryptosystem
نویسندگان
چکیده
Commitment schemes are fundamental bricks for guaranteeing fairness in upper level cryptographic protocols. Most commitment schemes in the literature rely on hash functions, which should be strongly collision free for the scheme to be secure. We present a commitment scheme, which avoids hash functions by using a public-key cryptosystem based on braid conjugator search problem instead.
منابع مشابه
On the Computational Collapse of Quantum Information
We analyze the situation where computationally binding string commitment schemes are used to force the receiver of a BB84 encoding of a classical bitstring to measure upon reception. Since measuring induces an irreversible collapse to the received quantum state, even given extra information after the measurement does not allow the receiver to evaluate reliably some predicates apply to the class...
متن کاملA Public-key Encryption Scheme Based on Non-linear Indeterminate Equations (Giophantus)
In this paper, we propose a post-quantum public-key encryption scheme whose security depends on a problem arising from a multivariate non-linear indeterminate equation. The security of lattice cryptosystems, which are considered to be the most promising candidate for a post-quantum cryptosystem, is based on the shortest vector problem or the closest vector problem in the discrete linear solutio...
متن کاملNon-Repudiable Proofs of Storage in Cloud
With the widespread use of cloud computing and cloud storage, how to ensure the authenticity of data in remote storage has become a severe problem. Provable data possession (PDP) and Proof of Retrievability (POR) are techniques for a client to verify whether an untrusted server possesses the original data entirely, and many PDP and POR schemes have been proposed to resolve above issue so far. B...
متن کاملPost-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
In this paper, we present a hybrid encryption scheme that is chosen ciphertext secure in the quantum random oracle model. Our scheme is a combination of an asymmetric and a symmetric encryption scheme that are secure in a weak sense. It is a slight modification of the Fujisaki-Okamoto transform that is secure against classical adversaries. In addition, we modify the OAEP-cryptosystem and prove ...
متن کاملElliptic Curve Isogenies-Based Three-party Password Authenticated Key Agreement Scheme towards Quantum-Resistant
Since quantum computers came on the scene, the world has changed greatly, especially related to cryptography. Public key cryptosystem, particularly RSA cryptosystem cant resist the quantum computers attack, so some quantum-resistant schemes have been proposed mainly based on quantum key distribution (QKD) method or new resistance to quantum algorithms. However, to the best of our knowledge, no ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010